Anderson-Björck for linear sequences
نویسندگان
چکیده
منابع مشابه
Subspace-diskcyclic sequences of linear operators
A sequence ${T_n}_{n=1}^{infty}$ of bounded linear operators on a separable infinite dimensional Hilbert space $mathcal{H}$ is called subspace-diskcyclic with respect to the closed subspace $Msubseteq mathcal{H},$ if there exists a vector $xin mathcal{H}$ such that the disk-scaled orbit ${alpha T_n x: nin mathbb{N}, alpha inmathbb{C}, | alpha | leq 1}cap M$ is dense in $M$. The goal of t...
متن کاملRandom Projection-Based Anderson-Darling Test for Random Fields
In this paper, we present the Anderson-Darling (AD) and Kolmogorov-Smirnov (KS) goodness of fit statistics for stationary and non-stationary random fields. Namely, we adopt an easy-to-apply method based on a random projection of a Hilbert-valued random field onto the real line R, and then, applying the well-known AD and KS goodness of fit tests. We conclude this paper by studying the behavior o...
متن کاملDecision Problems for Linear Recurrence Sequences
Linear recurrence sequences (LRS), such as the Fibonacci numbers, permeate vast areas of mathematics and computer science. In this talk, we consider three natural decision problems for LRS, namely the Skolem Problem (does a given LRS have a zero?), the Positivity Problem (are all terms of a given LRS positive?), and the Ultimate Positivity Problem (are all but finitely many terms of a given LRS...
متن کاملWavelet Linear Density Estimation for Associated Sequences
We develop a wavelet based linear density estimator for the estimation of the probability density function for a sequence of associated random variables with a common onedimensional probability density function and obtain bounds on Lp-losses for such estimators.
متن کاملPseudoprimes for Higher-order Linear Recurrence Sequences
With the advent of high-speed computing, there is a rekindled interest in the problem of determining when a given whole number N > 1 is prime or composite. While complex algorithms have been developed to settle this for 200-digit numbers in a matter of minutes with a supercomputer, there is a need for simpler, more practical algorithms for dealing with numbers of a more modest size. Such practi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1983
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1983-0717729-6